Decomposition of approximate derivatives
نویسندگان
چکیده
منابع مشابه
Fast Approximate Convex Decomposition
Fast Approximate Convex Decomposition. (August 2012) Mukulika Ghosh, B.Tech, National Instrtitue of Technology, Durgapur Chair of Advisory Committee: Dr. Nancy M. Amato Approximate convex decomposition (ACD) is a technique that partitions an input object into approximately convex components. Decomposition into approximately convex pieces is both more efficient to compute than exact convex decom...
متن کاملDerivatives of Approximate Regular Expressions
Our aim is to construct a finite automaton recognizing the set of words that are at a bounded distance from some word of a given regular language. We define new regular operators, the similarity operators, based on a generalization of the notion of distance and we introduce the family of regular expressions extended to similarity operators, that we call AREs (Approximate Regular Expressions). W...
متن کاملApproximate Uni-directional Benders Decomposition
We examine a decomposition approach to find good quality feasible solutions. In particular, we study a method to reduce the search-space by decomposing a problem into two partitions, where the second partition (i.e., the subproblem) contains the fixed solution of the first (i.e., the master). This type of approach is usually motivated by the presence of two sub-problems that are each more easil...
متن کاملFast approximate convex decomposition using relative concavity
Approximate convex decomposition (ACD) is a technique that partitions an input object into approximately convex components. Decomposition into approximately convex pieces is both more efficient to compute than exact convex decomposition and can also generate a more manageable number of components. It can be used as a basis of divide-and-conquer algorithms for applications such as collision dete...
متن کاملApproximate UV computation based on space decomposition
Voronoi diagrams are commonly used to answer traditional nearestneighbor queries in spatial databases. In this work, we propose a new approach to compute Voronoi-cells for the case of uncertain objects having rectangular uncertainty regions. Since exact computation of Voronoi-cells is a hard problem, we instead propose an approximate solution. The main idea of this solution is to apply hierarch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1978
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1978-0466446-9